Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/SK90SLASH2.37.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

and₃(not₁(not₁(x)), y, not₁(z)) -> and₃(y, band₂(x, z), x)

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

and₃(not₁(not₁(x)), y, not₁(z)) -> and₃(y, band₂(x, z), x)

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

and₃(not₁(not₁(x)), y, not₁(z)) -> and₃(y, band₂(x, z), x)

The set Q consists of the following terms:

and₃(not₁(not₁(x0)), x1, not₁(x2))

Q DP problem:
The TRS P consists of the following rules:

AND₃(not₁(not₁(x)), y, not₁(z)) -> AND₃(y, band₂(x, z), x)

The TRS R consists of the following rules:

and₃(not₁(not₁(x)), y, not₁(z)) -> and₃(y, band₂(x, z), x)

The set Q consists of the following terms:

and₃(not₁(not₁(x0)), x1, not₁(x2))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

AND₃(not₁(not₁(x)), y, not₁(z)) -> AND₃(y, band₂(x, z), x)

The TRS R consists of the following rules:

and₃(not₁(not₁(x)), y, not₁(z)) -> and₃(y, band₂(x, z), x)

The set Q consists of the following terms:

and₃(not₁(not₁(x0)), x1, not₁(x2))

We have to consider all minimal (P,Q,R)-chains.